On Computing the Fuzzy Weighted Average Using the KM Algorithms
نویسنده
چکیده
By connecting the fuzzy weighted average (FWA) and the generalized centroid (GC) of an interval type-2 fuzzy set we have arrived at a new αcut algorithm for solving the FWA problem, one that is monotonically and super-exponentially convergent. Our new algorithm uses the Karnik-Mendel (KM) algorithms to compute the FWA α-cut end-points. No faster algorithm for solving this problem exists to-date.
منابع مشابه
Aggregation Using the Fuzzy Weighted Average as Computed by the Karnik-Mendel Algorithms
By connecting work from two different problems— the fuzzy weighted average (FWA) and the generalized centroid of an interval type-2 fuzzy set—a new -cut algorithm for solving the FWA problem has been obtained, one that is monotonically and superexponentially convergent. This new algorithm uses the Karnik–Mendel (KM) algorithms to compute the FWA -cut endpoints. It appears that the KM -cut algor...
متن کاملINTERVAL ANALYSIS-BASED HYPERBOX GRANULAR COMPUTING CLASSIFICATION ALGORITHMS
Representation of a granule, relation and operation between two granules are mainly researched in granular computing. Hyperbox granular computing classification algorithms (HBGrC) are proposed based on interval analysis. Firstly, a granule is represented as the hyperbox which is the Cartesian product of $N$ intervals for classification in the $N$-dimensional space. Secondly, the relation betwee...
متن کاملVoting Algorithm Based on Adaptive Neuro Fuzzy Inference System for Fault Tolerant Systems
some applications are critical and must designed Fault Tolerant System. Usually Voting Algorithm is one of the principle elements of a Fault Tolerant System. Two kinds of voting algorithm are used in most applications, they are majority voting algorithm and weighted average algorithm these algorithms have some problems. Majority confronts with the problem of threshold limits and voter of weight...
متن کاملVoting Algorithm Based on Adaptive Neuro Fuzzy Inference System for Fault Tolerant Systems
some applications are critical and must designed Fault Tolerant System. Usually Voting Algorithm is one of the principle elements of a Fault Tolerant System. Two kinds of voting algorithm are used in most applications, they are majority voting algorithm and weighted average algorithm these algorithms have some problems. Majority confronts with the problem of threshold limits and voter of weight...
متن کاملBilateral Weighted Fuzzy C-Means Clustering
Nowadays, the Fuzzy C-Means method has become one of the most popular clustering methods based on minimization of a criterion function. However, the performance of this clustering algorithm may be significantly degraded in the presence of noise. This paper presents a robust clustering algorithm called Bilateral Weighted Fuzzy CMeans (BWFCM). We used a new objective function that uses some k...
متن کامل